Fully Dynamically Maintaining Minimal Integral Separator for Threshold and Difference Graphs

نویسندگان

  • Tiziana Calamoneri
  • Angelo Monti
  • Rossella Petreschi
چکیده

This paper deals with the well known classes of threshold and difference graphs, both characterized by separators, i.e. node weight functions and thresholds. We show how to maintain minimum the value of the separator when the input (threshold or difference) graph is fully dynamic, i.e. edges/nodes are inserted/removed. Moreover, exploiting the data structure used for maintaining the minimality of the separator, we handle the operations of disjoint union and join of two threshold graphs.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Minimal Integral Separator of a Threshold Graph

A graph is called threshold if there exists a real number b and real numbers aj associated with its vertices w, such that ims a, < b holds iff S is a stable (independent) set of vertices. The vector (a ,..., a; b) associated to a threshold graph is called an integral separator if ai + a > b + 1 for every edge (w,, wj). A simple algorithm is presented to determine for a given threshold graph its...

متن کامل

Dynamic Effective Resistances and Approximate Schur Complement on Separable Graphs

We consider the problem of dynamically maintaining (approximate) all-pairs effective resistances in separable graphs, which are those that contain small balanced separators. We give a fully dynamic algorithm that maintains (1 + ε)-approximations of the all-pairs effective resistances of an n-vertex graph G undergoing edge insertions and deletions with Õ( √ n/ε) worst-case update time and Õ( √ n...

متن کامل

A threshold approach to connected domination

A connected dominating set in a graph is a dominating set of vertices that induces a connected subgraph. We introduce and study the connected-domishold graphs, defined as graphs that admit non-negative real weights associated to their vertices such that a set of vertices is a connected dominating set if and only if the sum of the corresponding weights exceeds a certain threshold. More specifica...

متن کامل

Investigation of Slug Suppression System in Deepwater Scenario

In pipeline-riser systems, pressure fluctuations which result from the formation of large liquid slugs and gas surges due to operational changes or low mass flow rate from production wells and the profile of pipeline-riser systems often lead to trips at the inlet of the separator; and thereby, the problem causes a a loss of the production.In this study, on a sample deep-water oil field off the ...

متن کامل

Graphs with complete minimal k-vertex separators

G. A. Dirac characterized chordal graphs as those in which minimal vertex separators always induce complete subgraphs. I generalize a traditional (2-)vertex separator to a k-vertex separator — meaning a set S of vertices whose removal puts k independent vertices into k separate components. Generalizing Dirac’s theorem, the {P5, 2P3}-free chordal graphs are the graphs in which minimal k-separato...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2016